Arithmetic, Geometry, and Coding Theory: Homage to Gilles Lachaud

Introduction to Arithmetic Coding - Theory and Practice

entropy coding, compression, complexity This introduction to arithmetic coding is divided in two parts. The first explains how and why arithmetic coding works. We start presenting it in very general terms, so that its simplicity is not lost under layers of implementation details. Next, we show some of its basic properties, which are later used in the computational techniques required for a prac...

Arithmetic Spacetime Geometry from String Theory

An arithmetic framework to string compactification is described. The approach is exemplified by formulating a strategy that allows to construct geometric compactifications from exactly solvable theories at c = 3. It is shown that the conformal field theoretic characters can be derived from the geometry of spacetime, and that the geometry is uniquely determined by the two-dimensional field theor...

Arithmetic Teichmuller Theory

By Grothedieck's Anabelian conjectures, Galois representations landing in outer automorphism group of the algebraic fundamental group which are associated to hyperbolic smooth curves defined over number fields encode all arithmetic information of these curves. The goal of this paper is to develope and arithmetic teichmuller theory, by which we mean, introducing arithmetic objects summarizing th...

Basic Algebraic Geometry for Coding Theory

An Introduction to Arithmetic Coding

Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbolwise recursive; i.e., it operates upon and encodes (decodes) one data symbol per iteration or recursion. On each recursion, the algorithm successively partitions an interval of the nu...